Eeciency Analysis of Overlapped Quadtrees
نویسندگان
چکیده
The technique of overlapping region quadtrees results in signiicant space reduction. This new form of data structure is suitable for representing sequences of similar binary raster images emerging in many areas. Apart from a short introduction to the method of overlapping, an analysis of the space reduction achieved is presented in this article. First, a general theorem about the average number of common nodes of two images obeying a general model is given. Next, two models of image similarity are introduced and the respective formulae are derived from the general one. Evaluating these formulae for various parameters shows the eeciency of overlapping.
منابع مشابه
Search Costs in Quadtrees and Singularity Perturbation
Quadtrees constitute a classical data structure for storing and accessing collections of points in multidimensional space. It is proved that, in any dimension, the cost of a random search in a randomly grown quadtree has logarithmic mean and variance and is asymptotically distributed as a normal variable. The limit distribution property extends to quadtrees of all dimensions a result only known...
متن کاملOverlapped adaptive partitioning for image coding based on the theory of iterated functions systems
Memoryless blockwise partitioning induces blockiness ar-tifacts highly disturbing to the human visual system. This paper presents a new partitioning with overlapped blocks in the context of image coding based on iterated transformations systems. Each block of the partition is extended by n pixels. As usual each cell is expressed as the contrac-tive transformation of another part of the image. D...
متن کاملSearch Costs in Quadtrees and Singularity Perturbation Asymptotics
Quadtrees constitute a classical data structure for storing and access-ing collections of points in multidimensional space. It is proved that, in any dimension, the cost of a random search in a randomly grown quadtree has logarithmic mean and variance and is asymptotically distributed as a normal variable. The limit distribution property extends to quadtrees of all dimensions a result only know...
متن کاملParallel Processing of Pointer Based Quadtrees on Hypercube Multiprocessors
This paper studies the parallel construction and manipulation of pointer based quadtrees on the hypercube multiprocessor. While parallel algorithms for the manipulation of a variant of linear quadtrees have been previously studied in the literature, no parallel pointer based quadtree construction algorithms have been presented. In this paper, we solve the problem of efficiently constructing poi...
متن کاملFaster Searching in Tries and Quadtrees - An Analysis of Level Compression
We analyze the behavior of the level-compressed trie, LC-trie, a compact version of the standard trie data structure. Based on this analysis, we argue that level compression improves the performance of both tries and quadtrees considerably in many practical situations. In particular, we show that LC-tries can be of great use for string searching in compressed text. Both tries and quadtrees are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995